On Multi-Access Edge Computing: A Survey of the Emerging 5G Network Edge Cloud Architecture and Orchestration
نویسندگان
چکیده
منابع مشابه
Access and Mobility Policy Control at the Network Edge
The fifth generation (5G) system architecture is defined as service-based and the core network functions are described as sets of services accessible through application programming interfaces (API). One of the components of 5G is Multi-access Edge Computing (MEC) which provides the open access to radio network functions through API. Using the mobile edge API third party analytics applications ...
متن کاملCompetitive Caching of Contents in 5G Edge Cloud Network
Abstract—The surge of mobile data traffic forces network operators to cope with capacity shortage. The deployment of small cells in 5G networks shall increase radio access capacity. Mobile edge computing technologies can be used to manage dedicated cache memory at the edge of mobile networks. As a result, data traffic can be confined within the radio access network thus reducing latency, round-...
متن کاملMulti-access Edge Computing: The driver behind the wheel of 5G-connected cars
The automotive and telco industries have taken an investment bet on the connected car market, pushing for the digital transformation of the sector by exploiting recent Information and Communication Technology (ICT) progress. As ICT developments continue, it is expected that the technology advancements will be able to fulfill the sophisticated requirements for vehicular use cases, such as low la...
متن کاملEdge Computing Aware NOMA for 5G Networks
With the fast development of Internet of things (IoT), the fifth generation (5G) wireless networks need to provide massive connectivity of IoT devices and meet the demand for low latency. To satisfy these requirements, Non-Orthogonal Multiple Access (NOMA) has been recognized as a promising solution for 5G networks to significantly improve the network capacity. In parallel with the development ...
متن کاملOn the edge geodetic and edge geodetic domination numbers of a graph
In this paper, we study both concepts of geodetic dominatingand edge geodetic dominating sets and derive some tight upper bounds onthe edge geodetic and the edge geodetic domination numbers. We also obtainattainable upper bounds on the maximum number of elements in a partitionof a vertex set of a connected graph into geodetic sets, edge geodetic sets,geodetic domin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Surveys & Tutorials
سال: 2017
ISSN: 1553-877X
DOI: 10.1109/comst.2017.2705720